- the degree of unsolvability
- Математика: степень неразрешимости
Универсальный англо-русский словарь. Академик.ру. 2011.
the degree of unsolvability
Смотреть что такое "the degree of unsolvability" в других словарях:
Turing degree — Post s problem redirects here. For the other Post s problem , see Post s correspondence problem. In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic … Wikipedia
PA degree — In recursion theory, a mathematical discipline, a PA degree is a Turing degree that computes a complete extension of Peano arithmetic (Jockusch 1987). These degrees are closely related to fixed point free (DNR) functions, and have been thoroughly … Wikipedia
Turing degree — noun Given a set of natural numbers, a measure of the level of algorithmic unsolvability of the set. See Also: Turing equivalent … Wiktionary
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Hilbert's tenth problem — is the tenth on the list of Hilbert s problems of 1900. Its statement is as follows:Given a Diophantine equation with any number of unknown quantities and with rational integral numerical coefficients: To devise a process according to which it… … Wikipedia
History of logic — Philosophy ( … Wikipedia
List of philosophy topics (D-H) — DDaDai Zhen Pierre d Ailly Jean Le Rond d Alembert John Damascene Damascius John of Damascus Peter Damian Danish philosophy Dante Alighieri Arthur Danto Arthur C. Danto Arthur Coleman Danto dao Daodejing Daoism Daoist philosophy Charles Darwin… … Wikipedia
George Boolos — Infobox Person name = George Boolos birth date = birth date|1940|9|4|mf=y birth place = New York, New York, U.S. death date = death date and age|1996|5|27|1940|9|4|mf=y death place = Cambridge, Massachusetts, U.S.George Stephen Boolos (September… … Wikipedia
George Boolos — George Stephen Boolos (4 de septiembre de 1940, Nueva York – 27 de mayo de 1996) fue un filósofo y estudioso de lógica matemática que enseñó en el Massachusetts Institute of Technology. Contenido 1 Vida 2 Trabajo 3 Véase también … Wikipedia Español
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
